On the graph isomorphism problem
نویسنده
چکیده
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
منابع مشابه
Graph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملYet Another Reduction from Graph to Ring Isomorphism Problems
It has been known that the graph isomorphism problem is polynomial-time many-one reducible to the ring isomorphism problem. In fact, two different reductions have already been proposed. For those reductions, rings of certain types have been used to represent a given graph. In this paper, we give yet another reduction, which is based on a simpler and more natural construction of a ring from a gr...
متن کاملFast-on*: an Extended Algorithm for Graph Isomorphism Problem and Graph Query Processing
Graphs are widely used to model complicated data semantics in many applications. In our paper [8], we proposed Fast-ON, an efficient algorithm for subgraph isomorphism problem. In this paper, we develop an efficient algorithm called Fast-ON* that extends Fast-ON to handle two other problems, namely, graph isomorphism problem and graph query processing. Our performance study shows that Fast-ON* ...
متن کاملStructural and logical approaches to the graph isomorphism problem
The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NP-complete. The question is still wide open, but a nu...
متن کاملOn the Complexity of Isomorphism Problems Related to Polytopes
We show that the problem to decide whether two (convex) polytopes are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the polytope isomorphism problem in bounded dimension, which is based on Luks’ algorithm for the isomorphism problem of graphs of bounded maximal degree.
متن کاملLinear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space isometry problem over a finite field in time polynomial in the underlying vector space size. We propose a venue of attack for the latter problem by viewing it as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0801.0398 شماره
صفحات -
تاریخ انتشار 2008